Predicting fill for sparse orthogonal factorization
نویسندگان
چکیده
منابع مشابه
Sparse Gaussian Elimination and Orthogonal Factorization
We consider the solution of a linear system Ax = b on a distributedmemorymachine when the matrixA has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a ll-reducingcolumn ordering of the matrix. We develop algorithms that use the associated separator tree to estimate the structure of the factor and to distribute and perform numeric com...
متن کاملPredicting the Structure of Sparse Orthogonal Factors
The problem of correctly predicting the structures of the orthogo nal factorsQ and R from the structure of a matrix A with full column rank is considered in this paper Recently Hare Johnson Olesky and van den Driessche have described a method to predict these structures and they have shown that corresponding to any speci ed nonzero element in the predicted structures of Q or R there exists a ma...
متن کاملPreordering and symbolic factorization for reduction of fill-ins in LU decomposition of large sparse matrices
Linear systems arise in large-scale scientific and engineering calculations. In many cases, coefficient matrices tend to be very large and sparse. Given a system of linear equations, direct solutions can be obtained using Gaussian elimination. The paper describes the application of the Gaussian elimination method in conjunction with reordering algorithms. Our main goal is to present an overview...
متن کاملOnline Learning for Matrix Factorization and Sparse Coding Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statistics. This paper focuses on the large-scale matrix factorization problem that consists of learning the basis set, adapting it to specific data. Variations of this problem include dictionary learning in signal processing, non...
متن کاملParallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1986
ISSN: 0004-5411,1557-735X
DOI: 10.1145/5925.5932